<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Medium
  </div>
  <div>
   <h1 class="question_title">
    515. Find Largest Value in Each Tree Row
   </h1>
   <p>
    You need to find the largest value in each row of a binary tree.
   </p>
   <p>
    <b>
     Example:
    </b>
    <br>
   </p>
   <pre>
<b>Input:</b> 

          1
         / \
        3   2
       / \   \  
      5   3   9 

<b>Output:</b> [1, 3, 9]
</pre>
  </div>
  <div>
   <h1 class="question_title">
    515. 在每个树行中找最大值
   </h1>
   <p>
    您需要在二叉树的每一行中找到最大的值。
   </p>
   <p>
    <strong>
     示例：
    </strong>
   </p>
   <pre>
<strong>输入:</strong> 

          1
         / \
        3   2
       / \   \  
      5   3   9 

<strong>输出:</strong> [1, 3, 9]
</pre>
  </div>
 </body>
</html>